Reconstructing a random scenery observed with random errors along a random walk path

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstructing a three-color scenery by observing it along a simple random walk path

Let {ξ(n)}n∈Z be a two-color random scenery, that is, a random coloring of Z in two colors, such that the ξ(i)’s are i.i.d. Bernoulli variables with parameter 1 2 . Let {S(n)}n∈N be a symmetric random walk starting at 0. Our main result shows that a.s., ξ ◦ S (the composition of ξ and S) determines ξ up to translation and reflection. In other words, by observing the scenery ξ along the random w...

متن کامل

Reconstructing a 2-color scenery by observing it along a simple random walk path

Let {~(n)}nEZbe a 2-color random scenery, that is a random coloration of in two colors, such that the ~(i)'s are i.i.d. Bernoulli variables with parameter~. Let {S(n)}nEN be a symmetric random walk starting at O. Our main result shows that a.s., ~ 0 S (the composition of ~ and S) determines ~ up to translation and reflection. In other words, by observing the scenery ~ along the random walk path...

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

Reconstructing a random scenery in polynomial time

Benjamini asked whether the scenery reconstruction problem can be solved in polynomial time In this article we answer his question in the a rmative for an i i d uniformly colored scenery on Z observed along a random walk path with bounded jumps We assume the random walk is recurrent can reach every integer with positive probability and the number of possible single steps for the random walk exc...

متن کامل

Annealed Deviations of Random Walk in Random Scenery

Let (Zn)n∈N be a d-dimensional random walk in random scenery, i.e., Zn = ∑n−1 k=0 Y (Sk) with (Sk)k∈N0 a random walk in Z d and (Y (z))z∈Zd an i.i.d. scenery, independent of the walk. The walker’s steps have mean zero and some finite exponential moments. We identify the speed and the rate of the logarithmic decay of P( 1 nZn > bn) for various choices of sequences (bn)n in [1,∞). Depending on (b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2003

ISSN: 0178-8051,1432-2064

DOI: 10.1007/s00440-003-0257-3